What Is a Coxeter Group?
ثبت نشده
چکیده
Coxeter groups arise in a wide variety of areas, so every mathematician should know some basic facts about them, including their connection to “Dynkin diagrams.” Proofs about these “groups generated by reflections” mainly use group theory, geometry, and combinatorics. This talk will briefly explain: what it means to say that G is a “group generated by reflections” (or, equivalently, that G is a “Coxeter group”); what it means to say that G is “of type An, Bn, or Dn”, and that all but finitely many of the “irreducible” finite groups generated by reflections are either dihedral groups or belong to these types. For further reading, see [1, Chap. 1], [2], or [3]. 1. What is a group generated by reflections? Example. In R2: The reflection across the y-axis is the map x;y , x;y . The reflection across the line y x is the map x;y , y;x . In general, it is easy to see that the reflection L across a line L is the unique isometry of R2 that fixes each point on the line L, and has order 2 (i.e., 2 L Id, but L Id). Definition. Let H be a hyperplane in Rn. (E.g., a line in R2 or a plane in R3.) The corresponding reflection H is the unique isometry of Rn that fixes each point on H, and has order 2. Remark. If H passes through the origin, and e is a unit vector that is orthogonal to H, then Hx x 2x e e: Example. Let L1 and L2 be two lines in R2, and assume L1L2 =m, for some m 2 Z. Then (using i as a shorthand for Li) 1 2 is a rotation through angle 2 =m, so 1 2 Id. Indeed, h 1; 2i is the dihedral group D2m, so it has the presentation D2m h 1; 2 j 2 1 2 2 1 2 1 i: This is a (fairly trivial) example of a finite group that is generated by reflections. In this theory, it is denoted I2m : the subscript 2 means that we are in R2, and them tells us that the order of 1 2 ism. Combined with the fact that reflections 1
منابع مشابه
Essays on Coxeter groups Coxeter elements in finite Coxeter groups
A finite Coxeter group possesses a distinguished conjugacy class of Coxeter elements. The literature about these is very large, but it seems to me that there is still room for a better motivated account than what exists. The standard references on thismaterial are [Bourbaki:1968] and [Humphreys:1990], butmy treatment follows [Steinberg:1959] and [Steinberg:1985], from which the clever parts of ...
متن کاملEriksson's numbers game and finite Coxeter groups
The numbers game is a one-player game played on a finite simple graph with certain “amplitudes” assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at the nodes using the amplitudes in a certain way. This game and its interactions with Coxeter/Weyl group theory and Lie theory have been studied by many author...
متن کاملQuotient Isomorphism Invariants of a Finitely Generated Coxeter Group
The isomorphism problem for finitely generated Coxeter groups is the problem of deciding if two finite Coxeter matrices define isomorphic Coxeter groups. Coxeter [4] solved this problem for finite irreducible Coxeter groups. Recently there has been considerable interest and activity on the isomorphism problem for arbitrary finitely generated Coxeter groups. In this paper we describe a family of...
متن کاملOn the Direct Indecomposability of Infinite Irreducible Coxeter Groups and the Isomorphism Problem of Coxeter Groups
In this paper we prove that any irreducible Coxeter group of infinite order is directly indecomposable as an abstract group, without the finite rank assumption. The key ingredient of the proof is that we can determine, for an irreducible Coxeter group W , the centralizers in W of the normal subgroups of W that are generated by involutions. As a consequence, we show that the problem of deciding ...
متن کاملMatching Theorems for Systems of a Finitely Generated Coxeter Group
The isomorphism problem for finitely generated Coxeter groups is the problem of deciding if two finite Coxeter matrices define isomorphic Coxeter groups. Coxeter [3] solved this problem for finite irreducible Coxeter groups. Recently there has been considerable interest and activity on the isomorphism problem for arbitrary finitely generated Coxeter groups. For a recent survey, see Mühlherr [10...
متن کاملVisual Decompositions of Coxeter Groups
A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W . A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions of a Coxeter group having special factors and special amalgamated subgroup are easily recognized from the presentation of the Coxeter group. If a Coxeter gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013